Dependencies between fuzzy conjunctions and implications

نویسنده

  • Anna Król
چکیده

This paper deals with some dependencies between fuzzy conjunctions and fuzzy implications. More precisely, a fuzzy implication generated from a fuzzy conjunction and a fuzzy conjunction induced by a fuzzy implication is considered. In the case of a fuzzy conjunction only border conditions and monotonicity are assumed. The results are illustrated by examples of weak fuzzy connectives.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Investigating the Use of Paratactic and Hypotactic Conjunctions among Iranian Pre-university Students

In an attempt to dispel the persisting fallacy that an individual’s grammar knowledge is indicative of the way they put this knowledge into practice, this study seeks to highlight the inconsistency which resides between one’s competence and performance in the domain of conjunctions. It aims to shed light on the discrepancy which lies between the knowledge and production of conjunctions. The res...

متن کامل

On dependencies and independencies of fuzzy implication axioms

A fuzzy implication, commonly defined as a two-place operation on the unit interval, is an extension of the classical binary implication. It plays important roles in both mathematical and applied sides of fuzzy set theory. Besides the basic axioms, there are many potential fuzzy implication axioms, among which eight are widely used in the literature. Different fuzzy implications satisfying diff...

متن کامل

The Role of Fuzzy Logic and Soft Computing in the Conception and Design of Intelligent Systems

A Contextual Approach for AI Systems Development p. 2 Typicality of Concept Instances: A Semiotic Way for Its Evaluation p. 3 Non-Conventional Conjunctions and Implications in Fuzzy Logic p. 16 A Comparative Fuzzy Modal Logic p. 27 Combining Neural Networks and Fuzzy Controllers p. 35 A Reinforcement Learning Algorithm based on 'Safety' p. 47 GAITS: Fuzzy Set-Based Algorithms for Computing Stra...

متن کامل

Attacking Parsing Bottlenecks with Unlabeled Data and Relevant Factorizations

Prepositions and conjunctions are two of the largest remaining bottlenecks in parsing. Across various existing parsers, these two categories have the lowest accuracies, and mistakes made have consequences for downstream applications. Prepositions and conjunctions are often assumed to depend on lexical dependencies for correct resolution. As lexical statistics based on the training set only are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011